Efficient Implementations of A Quantum-Resistant Key-Exchange Protocol on Embedded systems
نویسندگان
چکیده
Presence of quantum computers is a real threat against the security of currently used public key cryptographic algorithms such as RSA and Elliptic curve cryptography. Isogeny computation on elliptic curves is believed to be difficult even on a quantum computer, and hence isogeny-based protocols represent one of the few truly practical approaches to constructing quantum-resistant cryptosystems. In this paper, we investigate the efficiency of implementing a newly proposed post-quantum key-exchange protocol on PC and ARM-powered embedded platforms. Our implementations on various mass-market emerging embedded devices significantly improve the state-of-the-art of post-quantum cryptographic computations on ARM-powered devices. We provided timing results and compared them to the counterparts available in the literature. For instance, Our timing results on PC platforms are between 18–26% faster than the previous work depending on the security level.
منابع مشابه
A New Ring-Based SPHF and PAKE Protocol On Ideal Lattices
emph{ Smooth Projective Hash Functions } ( SPHFs ) as a specific pattern of zero knowledge proof system are fundamental tools to build many efficient cryptographic schemes and protocols. As an application of SPHFs, emph { Password - Based Authenticated Key Exchange } ( PAKE ) protocol is well-studied area in the last few years. In 2009, Katz and Vaikuntanathan described the first lattice-based ...
متن کاملPhotonic quantum computers and communication systems
Quantum information processors have been proposed to solve classically intractable or unsolvable problems in computing, sensing, and secure communication. There has been growing interest in photonic implementations of quantum processors as they offer relatively long coherence lengths, precise state manipulation, and efficient measurement. In this thesis, we first present experimental techniques...
متن کاملDiffie-Hellman type key exchange protocols based on isogenies
In this paper, we propose some Diffie-Hellman type key exchange protocols using isogenies of elliptic curves. The first method which uses the endomorphism ring of an ordinary elliptic curve $ E $, is a straightforward generalization of elliptic curve Diffie-Hellman key exchange. The method uses commutativity of the endomorphism ring $ End(E) $. Then using dual isogenies, we propose...
متن کاملFast Arithmetic Modulo 2x py ± 1
We give a systematic overview of techniques to compute efficient arithmetic modulo 2p±1. This is useful for computations in the supersingular isogeny Diffie-Hellman (SIDH) keyexchange protocol which is one of the more recent contenders in the post-quantum public-key arena. One of the main computational bottlenecks in this key-exchange protocol is computing modular arithmetic in a finite field d...
متن کاملNEON-SIDH: Efficient Implementation of Supersingular Isogeny Diffie-Hellman Key Exchange Protocol on ARM
In this paper, we investigate the e ciency of implementing a post-quantum key exchange protocol over isogenies (PQCrypto 2011) on ARM-powered embedded platforms. This work proposes to employ new primes to speed up constant-time nite eld arithmetic and perform isogenies quickly. Montgomery multiplication and reduction are employed to produce a speedup of 3 over the GNU Multiprecision Library. We...
متن کامل